#include<iostream>

using namespace std;
using ll = long long;
ll n, a, b;
const int N = 5e5 + 10;
ll w[N];
bool check(ll x)
{
    ll cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        if (w[i] <= a * x) continue;
        ll d = w[i] - a * x;
        cnt += d / b + ((d % b) ? 1 : 0);
    }
    return cnt <= x;
}
int main()
{
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i++) scanf("%lld", &w[i]);
    // 直接二分答案，找到符合条件的时间
    int l = 1, r = 5e5;
    while (l < r)
    {
        ll mid = (r + l) / 2;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }

    cout << l << endl;
    return 0;
}